Structure Discovery in Biology: Motifs, Networks & Phylogenies
نویسندگان
چکیده
From 15.07.12 to 20.07.12, the Dagstuhl Seminar 12291 “Structure Discovery in Biology: Motifs, Networks & Phylogenies” was held in Schloss Dagstuhl – Leibniz Center for Informatics. The seminar was in part a follow-up to Dagstuhl Seminar 10231, held in June 2010, this time with a strong emphasis on large data. Both veterans and new participants took part in this edition. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar, as well as abstracts of seminar results and ideas, are put together in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. Seminar 15.–20. July, 2012 – www.dagstuhl.de/12291 1998 ACM Subject Classification algorithms, theory, pattern matching, text analysis, biology and genetics, health
منابع مشابه
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291)
From June 6 to June 11, 2010, the Dagstuhl Seminar 10231 Structure Discovery in Biology: Motifs, Networks & Phylogenies was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar re...
متن کاملRemote Homology Detection of Protein Sequences
The automatic classification of protein sequences into families is of great help for the functional prediction and annotation of new proteins. In the paper we present a method called Irredundant Class that address the remote homology detection problem. The best performing methods that solve this problem are string kernels, that compute a similarity function between pairs of proteins based on th...
متن کاملA New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance
The genomic distance problem in the Hannenhalli-Pevzner (HP) theory is the following: Given two genomes whose chromosomes are linear, calculate the minimum number of translocations, fusions, fissions and inversions that transform one genome into the other. This paper presents a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a uni...
متن کاملA New Tree Distance Metric for Structural Comparison of Sequences
In this paper we consider structural comparison of sequences, that is, to compare sequences not by their content but by their structure. We focus on the case where this structure can be defined by a tree and propose a new tree distance metric that capture structural similarity. This metric satisfies nonnegativity, identity, symmetry and the triangle inequality. We give algorithms to compute thi...
متن کاملSecurity and Dependability for Federated Cloud Platforms (Dagstuhl Seminar 12281)
AI meets Formal Software Development (Dagstuhl Seminar 12271) Alan Bundy, Dieter Hutter, Cliff B. Jones, and J Strother Moore . . . . . . . . . . . . . . . . 1 Architecture-Driven Semantic Analysis of Embedded Systems (Dagstuhl Seminar 12272) Peter Feiler, Jérôme Hugues, and Oleg Sokolsky . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 Security and Dependability for Federat...
متن کامل